منابع مشابه
Regret Minimization Algorithms for Pricing Lookback Options
In this work, we extend the applicability of regret minimization to pricing financial instruments, following the work of [10]. More specifically, we consider pricing a type of exotic option called a fixed-strike lookback call option. A fixed-strike lookback call option has a known expiration time, at which the option holder has the right to receive the difference between the maximal price of a ...
متن کاملApproximation algorithms for regret minimization in vehicle routing problems
In this thesis, we present new approximation algorithms as well as hardness of approximation results for N P-hard vehicle routing problems related to public transportation. We consider two different problem classes that also occur frequently in areas such as logistics, robotics, or distribution systems. For the first problem class, the goal is to visit as many locations in a network as possible...
متن کاملRegret Minimization for Branching Experts
We study regret minimization bounds in which the dependence on the number of experts is replaced by measures of the realized complexity of the expert class. The measures we consider are defined in retrospect given the realized losses. We concentrate on two interesting cases. In the first, our measure of complexity is the number of different “leading experts”, namely, experts that were best at s...
متن کاملEfficient Constrained Regret Minimization
Online learning constitutes a mathematical and compelling framework to analyze sequential decision making problems in adversarial environments. The learner repeatedly chooses an action, the environment responds with an outcome, and then the learner receives a reward for the played action. The goal of the learner is to maximize his total reward. However, there are situations in which, in additio...
متن کاملCounterfactual Regret Minimization for Decentralized Planning
Regret minimization is an effective technique for almost surely producing Nash equilibrium policies in coordination games in the strategic form. Decentralized POMDPs offer a realistic model for sequential coordination problems, but they yield doubly exponential sized games in the strategic form. Recently, counterfactual regret has offered a way to decompose total regret along a (extensive form)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2019
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v33i01.33011600